Finite Element Mesh Sizing for Surfaces Using Skeleton

نویسندگان

  • William Roshan Quadros
  • Steven J. Owen
  • Michael L. Brewer
  • Kenji Shimada
چکیده

The finite element (FE) mesh sizing has great influence on computational time, memory usage, and accuracy of FE analysis. Based on a systematic in-depth study of the geometric complexity of a set of connected surfaces, a computational procedure for the generation of FE mesh sizing function is proposed. The computational procedure has three main steps: (1) Generation of source points that determine the size and gradient at certain points on the surface; (2) generation of an octree lattice for storing the sizing function; and (3) interpolation of mesh size on the lattice. The source points are generated automatically using a set of tools that are sufficient to completely measure the geometric complexity of surfaces. A disconnected skeleton of the input surface is generated, and it is then used as one of the tools to measure the proximity between curves and vertices that form the boundary of a surface. Octree lattice is used as it reduces the time for calculating the mesh size at a point during meshing. The size at the octree lattice-nodes is calculated by interpolating the size of the source points. The computational procedure is independent of the meshing algorithm; it can handle non-geometric factors, and it is capable of generating variety of meshes by providing the user with enough control of mesh size and gradation. The proposed approach has been tested on many industrial models, and graded surface meshes have been generated successively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hexahedral Mesh Refinement Using an Error Sizing Function

Hexahedral Mesh Refinement Using an Error Sizing Function Gaurab Paudel Department of Civil and Environmental Engineering Master of Science The ability to effectively adapt a mesh is a very important feature of high fidelity finite element modeling. In a finite element analysis, a relatively high node density is desired in areas of the model where there are high error estimates from an initial ...

متن کامل

Skeletonization of Three-Dimensional Object Using Generalized Potential Field

ÐThe medial axis transform (MAT) is a skeletal representation of an object which has been shown to be useful in interrogation, animation, finite element mesh generation, path planning, and feature recognition. In this paper, the potential-based skeletonization approach for 2D MAT [1], which identifies object skeleton as potential valleys using a Newtonian potential model in place of the distanc...

متن کامل

A new protocol for the rapid generation of accurate anatomically realistic Finite Element Meshes of the head from T1 MRI scans

Reconstruction of images in Electrical Impedance Tomography (EIT) of brain function in the adult head benefits from the use of accurate numerical models, which may utilize meshes created by the Finite Element Method (FEM). Previously, these have been produced by manual segmentation and parametric representation of surfaces which were later meshed, but this was time consuming and required CAD sp...

متن کامل

Advances in the use of simplicial Finite Elements for Flow problems

This fact motivated the rise of alternative simulation approaches (Lattice Boltzmann, Finite Differences, Finite Element Embedded approaches), which approximate the shape of the object of interest by the use of local refinement techniques or simply by employing finer discretizations. Within the area of the Finite Element Method (FEM), the challenge its often addressed by the use of tetrahedral ...

متن کامل

Fast Finite Element Method Using Multi-Step Mesh Process

This paper introduces a new method for accelerating current sluggish FEM and improving memory demand in FEM problems with high node resolution or bulky structures. Like most of the numerical methods, FEM results to a matrix equation which normally has huge dimension. Breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. For implementing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004